Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(0, 1, x) → f(g(x), g(x), x)
f(g(x), y, z) → g(f(x, y, z))
f(x, g(y), z) → g(f(x, y, z))
f(x, y, g(z)) → g(f(x, y, z))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(0, 1, x) → f(g(x), g(x), x)
f(g(x), y, z) → g(f(x, y, z))
f(x, g(y), z) → g(f(x, y, z))
f(x, y, g(z)) → g(f(x, y, z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(g(x), y, z) → F(x, y, z)
F(0, 1, x) → F(g(x), g(x), x)
F(x, y, g(z)) → F(x, y, z)
F(x, g(y), z) → F(x, y, z)

The TRS R consists of the following rules:

f(0, 1, x) → f(g(x), g(x), x)
f(g(x), y, z) → g(f(x, y, z))
f(x, g(y), z) → g(f(x, y, z))
f(x, y, g(z)) → g(f(x, y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

F(g(x), y, z) → F(x, y, z)
F(0, 1, x) → F(g(x), g(x), x)
F(x, y, g(z)) → F(x, y, z)
F(x, g(y), z) → F(x, y, z)

The TRS R consists of the following rules:

f(0, 1, x) → f(g(x), g(x), x)
f(g(x), y, z) → g(f(x, y, z))
f(x, g(y), z) → g(f(x, y, z))
f(x, y, g(z)) → g(f(x, y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F(g(x), y, z) → F(x, y, z)
F(0, 1, x) → F(g(x), g(x), x)
F(x, y, g(z)) → F(x, y, z)
F(x, g(y), z) → F(x, y, z)

The TRS R consists of the following rules:

f(0, 1, x) → f(g(x), g(x), x)
f(g(x), y, z) → g(f(x, y, z))
f(x, g(y), z) → g(f(x, y, z))
f(x, y, g(z)) → g(f(x, y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


F(x, y, g(z)) → F(x, y, z)
The remaining pairs can at least be oriented weakly.

F(g(x), y, z) → F(x, y, z)
F(0, 1, x) → F(g(x), g(x), x)
F(x, g(y), z) → F(x, y, z)
Used ordering: Combined order from the following AFS and order.
F(x1, x2, x3)  =  F(x3)
g(x1)  =  g(x1)
0  =  0
1  =  1

Recursive path order with status [2].
Quasi-Precedence:
[g1, 1] > F1

Status:
1: multiset
0: multiset
g1: multiset
F1: multiset


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F(g(x), y, z) → F(x, y, z)
F(0, 1, x) → F(g(x), g(x), x)
F(x, g(y), z) → F(x, y, z)

The TRS R consists of the following rules:

f(0, 1, x) → f(g(x), g(x), x)
f(g(x), y, z) → g(f(x, y, z))
f(x, g(y), z) → g(f(x, y, z))
f(x, y, g(z)) → g(f(x, y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.